Complexity of Finding Non-Planar Rectilinear Drawings of Graphs
نویسندگان
چکیده
Monotone Drawings of Graphs p. 13 Upward Geometric Graph Embeddings into Point Sets p. 25 On a Tree and a Path with No Geometric Simultaneous Embedding p. 38 Difference Map Readability for Dynamic Graphs p. 50 Maximizing the Total Resolution of Graphs p. 62 Plane Drawings of Queue and Deque Graphs p. 68 An Experimental Evaluation of Multilevel Layout Methods p. 80 Orthogonal Graph Drawing with Flexibility Constraints p. 92 Drawing Ordered (k 1)-Ary Trees on k-Grids p. 105 Optimizing Regular Edge Labelings p. 117 Drawing Graphs in the Plane with a Prescribed Outer Face and Polynomial Area p. 129 Crossing Minimization and Layouts of Directed Hypergraphs with Port Constraints p. 141 Drawing Graphs on a Smartphone p. 153 Topology-Driven Force-Directed Algorithms p. 165 On Graphs Supported by Line Sets p. 177 Drawing Trees with Perfect Angular Resolution and Polynomial Area p. 183 Lombardi Drawings of Graphs p. 195 Optimal ISD Angular Resolution for Low-Degree Graphs p. 208 Improved Lower Bounds on the Area Requirements of Series-Parallel Graphs p. 220 A Computational Approach to Conway's Thrackle Conjecture p. 226 Optimal K-Level Planarization and Crossing Minimization p. 238 On Touching Triangle Graphs p. 250 Triangle Contact Representations and Duality p. 262 On Maximum Differential Graph Coloring p. 274 Dot Product Representations of Planar Graphs p. 287 Drawing Planar Graphs of Bounded Degree with Few Slopes p. 293 Complexity of Finding Non-planar Rectilinear Drawings of Graphs p. 305 Point-Set Embeddings of Plane 3-Trees (Extended Abstract) p. 317 Improving Layered Graph Layouts with Edge Bundling p. 329 Confluent Drawing Algorithms Using Rectangular Dualization p. 341 How to Draw a Tait-Colorable Graph p. 353 Universal Pointsets for 2-Coloured Trees p. 365 The Quality Ratio of RAC Drawings and Planar Drawings of Planar Graphs p. 371 Convex Polygon Intersection Graphs p. 377 Posters■ GraphML-Based Exploration and Evaluation of Efficient Parallelization Alternatives for Automation Firmware p. 389
منابع مشابه
The Complexity of Simultaneous Geometric Graph Embedding
Given a collection of planar graphs G1, . . . , Gk on the same set V of n vertices, the simultaneous geometric embedding (with mapping) problem, or simply k-SGE, is to find a set P of n points in the plane and a bijection φ : V → P such that the induced straight-line drawings of G1, . . . , Gk under φ are all plane. This problem is polynomial-time equivalent to weak rectilinear realizability of...
متن کاملOn the Perspectives Opened by Right Angle Crossing Drawings
Right Angle Crossing (RAC) drawings are polyline drawings where each crossing forms four right angles. RAC drawings have been introduced because cognitive experiments provided evidence that increasing the number of crossings does not decrease the readability of a drawing if edges cross at right angles. We investigate to what extent RAC drawings can help in overcoming the limitations of widely a...
متن کاملSmooth Orthogonal Drawings of Planar Graphs
In smooth orthogonal layouts of planar graphs, every edge is an alternating sequence of axis-aligned segments and circular arcs with common axisaligned tangents. In this paper, we study the problem of finding smooth orthogonal layouts of low edge complexity, that is, with few segments per edge. We say that a graph has smooth complexity k—for short, an SCk-layout—if it admits a smooth orthogonal...
متن کاملEfficient Algorithms for Drawing Planar Graphs
This thesis presents efficient algorithms for drawing planar graphs. Graph drawing addresses the problem of constructing geometric representation of information and finds applications in almost every branch of science and technology. In this thesis we study rectangular drawings, orthogonal drawings, convex drawings and our newly defined box-rectangular drawings. Rectangular drawings and box-rec...
متن کاملEdge-Weighted Contact Representations of Planar Graphs
We study contact representations of edge-weighted planar graphs, where vertices are rectangles or rectilinear polygons and edges are polygon contacts whose lengths represent the edge weights. We show that for any given edge-weighted planar graph whose outer face is a quadrangle, that is internally triangulated and that has no separating triangles we can construct in linear time an edge-proporti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010